Generalised Polygons Admitting a Point-Primitive Almost Simple Group of Suzuki or Ree Type
نویسندگان
چکیده
منابع مشابه
Generalised Polygons Admitting a Point-Primitive Almost Simple Group of Suzuki or Ree Type
Let G be a collineation group of a thick finite generalised hexagon or generalised octagon Γ. If G acts primitively on the points of Γ, then a recent result of Bamberg et al. shows that G must be an almost simple group of Lie type. We show that, furthermore, the minimal normal subgroup S of G cannot be a Suzuki group or a Ree group of type G2, and that if S is a Ree group of type F4, then Γ is ...
متن کاملThe locally 2-arc transitive graphs admitting an almost simple group of Suzuki type
A graph Γ is said to be locally (G, 2)-arc transitive for G a subgroup of Aut(Γ) if, for any vertex α of Γ, G is transitive on the 2-arcs of Γ starting at α. In this talk, we will discuss general results involving locally (G, 2)-arc transitive graphs and recent progress toward the classification of the locally (G, 2)-arc transitive graphs, where Sz(q) ≤ G ≤ Aut(Sz(q)), q = 2 for some k ∈ N. In ...
متن کاملOn the simple groups of Suzuki and Ree
We develop a new and uniform approach to the three families of simple groups of Lie type discovered by Suzuki and Ree, without using Lie algebras. A novel type of algebraic structure is defined, whose automorphism groups are the groups in question. This leads to elementary proofs of the group orders and simplicity, as well as much information on subgroup structure and geometry.
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملOn the automorphism groups of symmetric graphs admitting an almost simple group
This paper investigates the automorphism group of a connected and undirected G-symmetric graph Γ where G is an almost simple group with socle T . First we prove that, for an arbitrary subgroup M of AutΓ containing G, either T is normal in M or T is a subgroup of the alternating group Ak of degree k = |Mα : Tα| − |NM (T ) : T |. Then we describe the structure of the full automorphism group of G-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2016
ISSN: 1077-8926
DOI: 10.37236/5510